Perron Values and Classes of Trees
نویسندگان
چکیده
The bottleneck matrix M of a rooted tree T is combinatorial object encoding the spatial distribution vertices with respect to root. spectral radius M, known as Perron value tree, closely related theory algebraic connectivity. In this paper, we investigate values various classes trees by making use and linear-algebraic techniques. This results in multiple bounds on these classes, which can be straightforwardly applied provide information
منابع مشابه
Chemical Trees with Extreme Values of Zagreb Indices and Coindices
We give sharp upper bounds on the Zagreb indices and lower bounds on the Zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملthe impact of attending efl classes on the level of depression of iranian female learners and their attributional complexity
می توان گفت واقعیت چند لایه ا ی کلاس های زبان انگلیسی بسیار حائز اهمیت است، زیرا عواطف و بینش های زبان آموزان تحت تاثیر قرار می گیرد. در پژوهش پیش رو، گفته می شود که دبیران با در پیش گرفتن رویکرد فرا-انسانگرایی ، قادرند در زندگی دانش آموزانشان نقش مهمی را ایفا سازند. بر اساس گفته ی ویلیامز و بردن (2000)، برای کرل راجرز، یکی از بنیان گذاران رویکرد انسانگرایی ، یادگیری بر مبنای تجربه، نوعی از یاد...
PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کاملSpanning Trees and Function Classes
If G = Kn is the complete graph, the classical Prüffer correspondence gives a natural bijection between all spanning trees of G (i.e., all Cayley trees) and all functions from a set of n−2 elements to a set of n elements. If G is a complete multipartite graph, then such bijections have been studied by Eğecioğlu and Remmel. In this paper, we define a class of directed graphs, called filtered dig...
متن کاملchemical trees with extreme values of zagreb indices and coindices
we give sharp upper bounds on the zagreb indices and lower bounds on the zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.01.005